On Cost-Optimal Merge of Two Intransitive Sorted Sequences
نویسندگان
چکیده
The problem of merging two intransitive sorted sequences that is to generate a sorted total order without the transitive property is considered A cost optimal parallel merging algorithm is proposed under the EREW PRAM model This algorithm has a run time of O log n using O n log n processors The cost optimal merge in the strong sense is still an open problem
منابع مشابه
Work-Time Optimal K-Merge Algorithms on the PRAM
The k-merge problem, given a collection of k, (2 k n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is to propose simple and intuitive work-time optimal algorithms for the k-merge problem on two PRAM models. Specifically, our k-merge algorithms perform O(n log k) work and run in O(logn) time on the EREW-PRAM and in O(log l...
متن کاملMerging and Merge-Sort in a Single Hop Radio Network
We present two merging algorithms on a single-channel single-hop radio network without collision detection. The simpler of these algorithms merges two sorted sequences of length n in time 4n with energetic cost for each station ≈ lg n. The energetic cost of broadcasting is constant. This yields the mergesort for n elements in time 2n lg n, where the energetic cost for each station is
متن کاملGeneration of Long Sorted Runs on the IBM SP2
In the first phase of sorting a large file, sorted sequences, called runs, are generated. In the second phase, the runs are merged into a sorted file. The merge time can be much greater than the runs-generation time. Generating longer runs and thus fewer runs in the first phase may greatly reduce the merge time. In this paper, we present a parallel algorithm that can utilize the broadcast capab...
متن کاملTwo Mathematical Models for Railway Crew Scheduling Problem
Railway crew scheduling problem is a substantial part of the railway transportation planning, which aims to find the optimal combination of the trip sequences (pairings), and assign them to the crew complements. In this problem, each trip must be covered by at least one pairing. The multiple-covered trips lead to impose useless transfers called “transitions”. In this study, a new ma...
متن کاملOn Sorting an Intransitive Total Ordered Set Using Semi-Heap
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a special linear ordering for any intransitive total ordered set. A new data structure called semi-heap is proposed to construct an optimal (n logn) sorting algorithm. Finally, we propose a cost-optimal parallel algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 14 شماره
صفحات -
تاریخ انتشار 2002